Isomorphism of graphs which are pairwise k-separable
نویسندگان
چکیده
منابع مشابه
Isomorphism of Graphs Which are k-Separable*
A polynomial time algorithm for testing isomorphism of graphs which are pairwise k-separable for fixed k is given. The pairwise k-separable graphs are those graphs where each pair of distinct vertices are k-separable. This is a natural generalization of the bounded valence test of Luks.The subgroup of automorphisms of a hypergraph whose restriction to the vertices is in a given group, for fixed...
متن کاملNot All Graphs are Pairwise Compatibility Graphs
Given an edge weighted tree T and two non-negative real numbers dmin and dmax, a pairwise compatibility graph of T for dmin and dmax is a graph G = (V, E), where each vertex u ∈ V corresponds to a leaf u of T and there is an edge (u, v) ∈ E if and only if dmin ≤ dT (u, v) ≤ dmax in T . Here, dT (u, v) denotes the distance between u and v in T , which is the sum of the weights of the edges on th...
متن کاملWhich graphs are pluperfect?
A graph G is pluperfect if one can add new multiple edges to obtain a multi graph M satisfying: (1) G spans M, (2) the degrees of the nodes of M are consecutive integers, (3) G and M have the same minimum degree. Our purpose is to display several families of pluperfect graphs in order to L Introduction My good friends Mehdi Behzad and Gary Chartrand wrote a note [1] titled "No graph is perfect"...
متن کاملOn the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs
In this paper we work to classify which of the (n, k)-star graphs, denoted by Sn,k, are Cayley graphs. Although the complete classification is left open, we derive infinite and non-trivial classes of both Cayley and non-Cayley graphs. We give a complete classification of the case when k = 2, showing that Sn,2 is Cayley if and only if n is a prime power. Additionally, it is shown that Sn,n−2 is ...
متن کاملWhich Haar graphs are Cayley graphs?
For a finite group G and subset S of G, the Haar graph H(G,S) is a bipartite regular graph, defined as a regular G-cover of a dipole with |S| parallel arcs labelled by elements of S. If G is an abelian group, then H(G,S) is well-known to be a Cayley graph; however, there are examples of non-abelian groups G and subsets S when this is not the case. In this paper we address the problem of classif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1983
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(83)80048-5